An ordered-subsets proximal preconditioned gradient algorithm for edge-preserving PET image reconstruction.
نویسندگان
چکیده
PURPOSE In iterative positron emission tomography (PET) image reconstruction, the statistical variability of the PET data precorrected for random coincidences or acquired in sufficiently high count rates can be properly approximated by a Gaussian distribution, which can lead to a penalized weighted least-squares (PWLS) cost function. In this study, the authors propose a proximal preconditioned gradient algorithm accelerated with ordered subsets (PPG-OS) for the optimization of the PWLS cost function and develop a framework to incorporate boundary side information into edge-preserving total variation (TV) and Huber regularizations. METHODS The PPG-OS algorithm is proposed to address two issues encountered in the optimization of PWLS function with edge-preserving regularizers. First, the second derivative of this function (Hessian matrix) is shift-variant and ill-conditioned due to the weighting matrix (which includes emission data, attenuation, and normalization correction factors) and the regularizer. As a result, the paraboloidal surrogate functions (used in the optimization transfer techniques) end up with high curvatures and gradient-based algorithms take smaller step-sizes toward the solution, leading to a slow convergence. In addition, preconditioners used to improve the condition number of the problem, and thus to speed up the convergence, would poorly act on the resulting ill-conditioned Hessian matrix. Second, the PWLS function with a nondifferentiable penalty such as TV is not amenable to optimization using gradient-based algorithms. To deal with these issues and also to enhance edge-preservation of the TV and Huber regularizers by incorporating adaptively or anatomically derived boundary side information, the authors followed a proximal splitting method. Thereby, the optimization of the PWLS function is split into a gradient descent step (upgraded by preconditioning, step size optimization, and ordered subsets) and a proximal mapping associated with boundary weighted TV and Huber regularizers. The proximal mapping is then iteratively solved by dual formulation of the regularizers. RESULTS The convergence performance of the proposed algorithm was studied with three different diagonal preconditioners and compared with the state-of-the-art separable paraboloidal surrogates accelerated with ordered-subsets (SPS-OS) algorithm. In simulation studies using a realistic numerical phantom, it was shown that the proposed algorithm depicts a considerably improved convergence rate over the SPS-OS algorithm. Furthermore, the results of bias-variance and signal-to-noise evaluations showed that the proposed algorithm with anatomical edge information depicts an improved performance over conventional regularization. Finally, the proposed PPG-OS algorithm is used for image reconstruction of a clinical study with adaptively derived boundary edge information, demonstrating the potential of the algorithm for fast and edge-preserving PET image reconstruction. CONCLUSIONS The proposed PPG-OS algorithm shows an improved convergence rate with the ability of incorporating additional boundary information in regularized PET image reconstruction.
منابع مشابه
Edge Artifacts in Point Spread Function-based PET Reconstruction in Relation to Object Size and Reconstruction Parameters
Objective(s): We evaluated edge artifacts in relation to phantom diameter and reconstruction parameters in point spread function (PSF)-based positron emission tomography (PET) image reconstruction.Methods: PET data were acquired from an original cone-shaped phantom filled with 18F solution (21.9 kBq/mL) for 10 min using a Biograph mCT scanner. The images were reconstructed using the baseline or...
متن کاملAccelerated image reconstruction using ordered subsets of projection data
The authors define ordered subset processing for standard algorithms (such as expectation maximization, EM) for image restoration from projections. Ordered subsets methods group projection data into an ordered sequence of subsets (or blocks). An iteration of ordered subsets EM is defined as a single pass through all the subsets, in each subset using the current estimate to initialize applicatio...
متن کاملImproved ordered subsets algorithm for 3D X-ray CT image reconstruction
Statistical image reconstruction methods improve image quality in X-ray CT, but long compute times are a drawback. Ordered subsets (OS) algorithms can accelerate convergence in the early iterations (by a factor of about the number of subsets) provided suitable “subset balance” conditions hold. OS algorithms are most effective when a properly scaled gradient of each subset data-fit term can appr...
متن کاملFully 3D PET Image Reconstruction Using A Fourier Preconditioned Conjugate-Gradient Algorithm
the data sizes in fully 3D PET imaging are very iterative image reconstruction algorithms must tge in very few iterations to be useful. One nprove the convergence rate of the conjugate:nt (CG) algorithm by incorporating precondig operators that approximate the inverse of the Ln of the objective function. If the 3D cylindriET geometry were not truncated at the ends, ;he Hessian of the penalized ...
متن کاملFully 3d Pet Image Reconstruction Using a Fourier Preconditioned Conjugate-gradient Algorithm
Since the data sizes in fully 3D PET imaging are very large, iterative image reconstruction algorithms must converge in very few iterations to be useful. One can improve the convergence rate of the conjugate-gradient (CG) algorithm by incorporating precondi-tioning operators that approximate the inverse of the Hessian of the objective function. If the 3D cylindrical PET geometry were not trunca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Medical physics
دوره 40 5 شماره
صفحات -
تاریخ انتشار 2013